Faster O(|V|^2|E|W)-Time Energy Algorithms for Optimal Strategy Synthesis in Mean Payoff Games
نویسندگان
چکیده
This study strengthens the links between Mean Payoff Games (MPGs) and Energy Games (EGs). Firstly, we offer a faster O(|V |2|E|W ) pseudo-polynomial time and Θ(|V |+ |E|) space deterministic algorithm for solving the Value Problem and Optimal Strategy Synthesis in MPGs. This improves the best previously known estimates on the pseudo-polynomial time complexity to:
منابع مشابه
An Improved Pseudo-Polynomial Upper Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games
We prove the existence of a pseudo-polynomial O(|V ||E|W ) time algorithm for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games. This improves by a factor log(|V |W ) the best previously known pseudo-polynomial upper bound due to Brim et al. The improvement hinges on a suitable characterization of values and optimal strategies in terms of reweightings.
متن کاملFaster Algorithms for Mean-Payoff Parity Games
Graph games provide the foundation for modeling and synthesis of reactive processes. Such games are played over graphs where the vertices are controlled by two adversarial players. We consider graph games where the objective of the first player is the conjunction of a qualitative objective (specified as a parity condition) and a quantitative objective (specified as a meanpayoff condition). Ther...
متن کاملThe Complexity of Mean Payoff Games
1 I n t r o d u c t i o n Let G = (V, E) be a finite directed graph in which each vertex has at least one edge going out of it. Let w : E , { W , . . . , 0 , . . . , W} be a function that assigns an integral weight to each edge of G. Ehrenfeucht and Mycielski [EM79] studied the following infinite two-person game played on such a graph. The game starts at a vertex a0 E V. The first player choose...
متن کاملFaster algorithms for mean-payoff games
In this paper, we study algorithmic problems for quantitative models that are motivated by the applications in modeling embedded systems. We consider two-player games played on a weighted graph with mean-payoff objective and with energy constraints. We present a new pseudopolynomial algorithm for solving such games, improving the best known worst-case complexity for pseudopolynomial mean-payoff...
متن کاملThe Complexity of Multi-Mean-Payoff and Multi-Energy Games
In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always nonnegative. Multi-mean-payoff and multi-energy games replace individual weights by tuples, and the limit average (resp., running sum) of each coordinate must be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1609.01517 شماره
صفحات -
تاریخ انتشار 2016